New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups

نویسنده

  • John B. Polhill
چکیده

A partial difference set having parameters (n2, r(n− 1), n+ r2 − 3r, r2 − r) is called a Latin square type partial difference set, while a partial difference set having parameters (n2, r(n+1),−n+r2+3r, r2+r) is called a negative Latin square type partial difference set. Nearly all known constructions of negative Latin square partial difference sets are in elementary abelian groups. In this paper, we develop three product theorems that construct negative Latin square type partial difference sets and Latin square type partial difference sets in direct products of abelian groups G and G′ when these groups have certain Latin square or negative Latin square type partial difference sets. Using these product theorems, we can construct negative Latin square type partial difference sets in groups of the form G = (Z2)0 × (Z4)1 × (Z16)2 × · · · × (Z22r) where the si are nonnegative integers and s0 + s1 ≥ 1. Another significant corollary to these theorems are constructions of two infinite families of negative Latin square type partial difference sets in 3-groups of the form G = (Z3) × (Z3)1 × (Z9)2 × · · · × (Z32k)k for nonnegative integers si. Several constructions of Latin square type PDSs are also given in p-groups for all primes p. We will then briefly indicate how some of these results relate to amorphic association schemes. In particular, we construct amorphic association schemes with 4 classes using negative Latin square type graphs in many nonelementary abelian 2-groups; we also use negative Latin square type graphs whose underlying sets can be elementary abelian 3-groups or nonelementary abelian 3-groups to form 3-class amorphic association schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalizations of Partial Difference Sets from Cyclotomy to Nonelementary Abelian p-Groups

A partial difference set having parameters (n2, r(n − 1), n + r2 − 3r, r2 − r) is called a Latin square type partial difference set, while a partial difference set having parameters (n2, r(n + 1),−n + r2 + 3r, r2 + r) is called a negative Latin square type partial difference set. In this paper, we generalize well-known negative Latin square type partial difference sets derived from the theory o...

متن کامل

Negative Latin Square Type Partial Difference Sets in Nonelementary Abelian 2-groups

Combining results on quadrics in projective geometries with an algebraic interplay between finite fields and Galois rings, we construct the first known family of partial difference sets with negative Latin square type parameters in nonelementary abelian groups, the groups Z 4 × Z4`−4k 2 for all k when ` is odd and for all k < ` when ` is even. Similarly, we construct partial difference sets wit...

متن کامل

Amorphic association schemes with negative Latin square-type graphs

Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative Latin square type graphs and whose underlying set is a nonelementary abelian 2-group. We give a simple proof of a result of Hamilton that generalizes Brouwer’s result. We use multiple distinct quadratic forms to constru...

متن کامل

Partial difference sets and amorphic group schemes from pseudo-quadratic bent functions

We present new abelian partial difference sets and amorphic group schemes of both Latin square type and negative Latin square type in certain abelian p-groups. Our method is to construct what we call pseudo-quadratic bent functions and use them in place of quadratic forms. We also discuss a connection between strongly regular bent functions and amorphic group schemes.

متن کامل

Linking systems in nonelementary abelian groups

Linked systems of symmetric designs are equivalent to 3-class Q-antipodal association schemes. Only one infinite family of examples is known, and this family has interesting origins and is connected to important applications. In this paper, we define linking systems, collections of difference sets that correspond to systems of linked designs, and we construct linking systems in a variety of non...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2008